The dynamic mode decomposition (DMD) is a data-driven matrix decomposition for spatio-temporal data grids. Originally introduced in the fluid mechanics community, DMD has been applied to several new domains, including ne

Source URL: mmds-data.org

WORKING PAPER N° Fostering the potential endogenous development of European regions: a spatial dynamic panel data analysis of the Cohesion Policy on regional

Source URL: www.tepp.eu

• Economic growth
• Economic development
• Economy of the European Union
• Structural Funds and Cohesion Fund
• SolowSwan model
• Regional policy of the European Union
• Convergence
• Endogenous growth theory
• Development economics
• Economic model
• Economics
• Productivity

A Compacting Real-Time Memory Management System Silviu S. Craciunas Christoph M. Kirsch

Source URL: www.cs.uni-salzburg.at

• Memory management
• Fragmentation
• Pointer
• C dynamic memory allocation
• Garbage collection
• Virtual memory
• Page
• Linked list
• Paging
• New and delete
• Data
• Memory segmentation

Parallel Generational-Copying Garbage Collection with a Block-Structured Heap Simon Marlow Tim Harris

Source URL: community.haskell.org

• Memory management
• Automatic memory management
• Data types
• C++
• Garbage collection
• Software design patterns
• Pointer
• C dynamic memory allocation
• Region-based memory management
• Weak reference
• Garbage
• Fragmentation

Record Linkage Using Error Prone Strings

Source URL: www.amstat.org

• Computational linguistics
• Dynamic programming
• JaroWinkler distance
• Data mining
• Natural language processing
• Record linkage
• Approximate string matching
• String metric
• Cluster analysis
• Linkage
• N-gram
• String

Sorting and Selection on Dynamic Data∗ Aris Anagnostopoulos† Ravi Kumar‡ Mohammad Mahdian‡

Source URL: bioinfo.ict.ac.cn

• Analysis of algorithms
• Sorting algorithms
• Computational complexity theory
• Permutations
• Quicksort
• Science
• Selection algorithm
• FisherYates shuffle
• Algorithm
• Time complexity
• Sort
• Best
• worst and average case

Multiple Sequence Alignment and Phylogenetic Reconstruction: Theory and Methods in Biological Data Analysis Gianluca Della Vedova

Source URL: www.statistica.unimib.it

• Bioinformatics
• Computational phylogenetics
• Phylogenetics
• Combinatorics
• Dynamic programming
• Sequence alignment
• Multiple sequence alignment
• Phylo
• Homology
• Shortest common supersequence problem
• Longest common subsequence problem
• Alignment-free sequence analysis

PolyCert: Polymorphic Self-Optimizing Replication for In-Memory Transactional Grids Maria Couceiro, Paolo Romano, Luis Rodrigues INESC-ID Instituto Superior Tecnico, Universidade Tecnica de Lisboa

Source URL: www.gsd.inesc-id.pt

• Transaction processing
• Data management
• Concurrency control
• Fault-tolerant computer systems
• Database management systems
• Software transactional memory
• Replication
• Database transaction
• In-memory database
• Dynamic data
• Distributed transaction
• Data grid

CS264: Beyond Worst-Case Analysis Lecture #7: Perturbation Stability and Single-Link++∗ Tim Roughgarden† October 13,

Source URL: theory.stanford.edu

• Operations research
• Cluster analysis
• Data mining
• Geostatistics
• K-means clustering
• K-medians clustering
• Minimum spanning tree
• Dynamic programming
• K-nearest neighbors algorithm

Array Shadow State Compression for Precise Dynamic Race Detection Williams College Technical Report CSTR, May, 2015 James Wilcox

Source URL: homes.cs.washington.edu

• Arrays
• Array data structure
• Array data type
• Array programming
• Dynamic array